A-Static-Periodic Solution Strategy for Dynamic Vehicle Routing Problem with Simultaneous Pickup and Delivery

Nowadays, logistic companies are dealing with the pressure of a highly competitive environment and trying to reduce operational costs. At same time, customers requiring not wait so long get their delivery pickup demands satisfied. In this study, these two factors considered a-static-periodic solution strategy. The problem is modelled as Dynamic Vehicle Routing Problem Simultaneous Pickup Delivery (DVRPSPD) where continuously arrived in planning horizon satisfied at time by vehicle. Furthermore, we proposed methodology based on solving routing problems repeatedly for each period considering new unvisited previous customers. A well-known heuristic, Nearest Neighbourhood Algorithm (NNA), used solve VRPSPDs period. Important real-life aspects such demand fluctuations, different number customers, periods integrated into problem. According results, average waiting times per customer significantly increase whereas travel visit notably decrease when length increases. If routes constructed 8 day, waits an 5 minutes compared 66 if it made 4 day. More plans cause more than 7-minute visit. Different test settings analysed results explained help decision makers find best both customers.